Computational hardness assumptions - PDFSEARCH.IO - Document Search Engine

Computational hardness assumptions
Results: 76

#	Item
31	CS255: Cryptography and Computer Security Winter 2004 Assignment #3 Due: Monday, March 1st, 2004. Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2004-02-22 02:05:11 Finite fields Cryptographic protocols Electronic commerce Diffie–Hellman key exchange XTR ElGamal encryption RSA Computational Diffie–Hellman assumption Discrete logarithm Cryptography Public-key cryptography Computational hardness assumptions
32	CS255: Cryptography and Computer Security Winter 2002 Assignment #3 Due: Friday, March 8th, 2002 at 5pm. Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2002-03-05 19:45:19 Computational hardness assumptions Electronic commerce Cryptographic protocols RSA Diffie–Hellman key exchange ElGamal encryption XTR Diffie–Hellman problem Computational Diffie–Hellman assumption Cryptography Public-key cryptography Finite fields
33	CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2005-01-04 13:22:38 Cryptographic protocols Electronic commerce Computational hardness assumptions RSA Diffie–Hellman key exchange Diffie–Hellman problem Discrete logarithm Schmidt–Samoa cryptosystem Paillier cryptosystem Cryptography Public-key cryptography Finite fields
34	Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups David Mandell Freeman? Stanford University [removed] Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2010-07-03 01:40:38 Computational hardness assumptions Finite groups Decisional Diffie–Hellman assumption XDH assumption XTR Cyclic group Subgroup Group action BLS Abstract algebra Group theory Algebra
35	Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups David Mandell Freeman Stanford University, USA Eurocrypt 2010 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2010-07-03 02:36:48 Group theory Cryptography Decisional Diffie–Hellman assumption Pairing G1 Subgroup XDH assumption Algebra Computational hardness assumptions Mathematics
36	Pairing-Based Identification Schemes Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2008-06-06 19:27:43 Public-key cryptography Finite fields BLS Computational Diffie–Hellman assumption Diffie–Hellman problem Decisional Diffie–Hellman assumption Diffie–Hellman key exchange Zero-knowledge proof Digital signature Cryptography Computational hardness assumptions Cryptographic protocols
37	CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2006-01-11 14:38:17 Cryptographic protocols Electronic commerce Computational hardness assumptions RSA Diffie–Hellman key exchange Diffie–Hellman problem Discrete logarithm Schmidt–Samoa cryptosystem Paillier cryptosystem Cryptography Public-key cryptography Finite fields
38	CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2002-05-13 22:32:41 Cryptographic protocols Electronic commerce Computational hardness assumptions RSA Diffie–Hellman key exchange Diffie–Hellman problem Discrete logarithm Schmidt–Samoa cryptosystem Paillier cryptosystem Cryptography Public-key cryptography Finite fields
39	CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2003-01-05 20:38:47 Cryptographic protocols Electronic commerce Computational hardness assumptions RSA Diffie–Hellman key exchange Diffie–Hellman problem Discrete logarithm Schmidt–Samoa cryptosystem Paillier cryptosystem Cryptography Public-key cryptography Finite fields
40	CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2004-01-05 17:05:04 Cryptographic protocols Electronic commerce Computational hardness assumptions RSA Diffie–Hellman key exchange Diffie–Hellman problem Discrete logarithm Schmidt–Samoa cryptosystem Paillier cryptosystem Cryptography Public-key cryptography Finite fields